One-Sided Cluster-Set Theory in a Polydisc

One-Sided Interval Trees

We give an alternative treatment and extension of some results of Itoh and Mahmoud on one-sided interval trees. The proofs are based on renewal theory, including a case with mixed multiplicative and additive renewals.

Evaluating one-sided programming models for GPU cluster computations

The Global Array toolkit (GA) [1] is a powerful framework for implementing algorithms with irregular communication patterns, such as those of quantum chemistry. On the other hand, accelerators such as GPUs have shown great potential for important kernels in quantum chemistry, for example, atomic integral generation [2] and dense linear algebra in correlated methods [3]. Integration of the globa...

Tiers in One-Sided Matching Markets: Theory and Experimental Investigation

Full terms and conditions of use:

One - sided Versus Two - sided Error in

Deriving Cluster Knowledge Using Rough Set Theory

Clustering algorithms gives general description of the clusters listing number of clusters and member entities in those clusters. It lacks in generating cluster description in the form of pattern. Deriving pattern from clusters along with grouping of data into clusters is important from data mining perspective. In the proposed approach reduct from rough set theory is employed to generate patter...